ARGOS: An adaptive refinement goal‐oriented solver for the linearized Poisson–Boltzmann equation

نویسندگان

چکیده

An adaptive finite element solver for the numerical calculation of electrostatic coupling between molecules in a solvent environment is developed and tested. At heart goal-oriented posteriori error estimate coupling, derived implemented present work, that gives rise to an orders magnitude improved precision shorter computational time as compared standard difference solvers. The accuracy new ARGOS evaluated by experiments on series problems with analytically known solutions. In addition, used calculate couplings two chromophores, linked polyproline helices different lengths spike protein SARS-CoV-2 ACE2 receptor. All calculations are repeated using well-known solvers MEAD APBS, revealing advantages solver.

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Towards adaptive mesh refinement for the spectral element solver Nek5000

When performing computational fluid dynamics (CFD) simulations of complex flows, the a priori knowledge of the flow physics and the location of the dominant flow features are usually unknown. For this reason, the development of adaptive remeshing techniques is crucial for large-scale computational problems. Some work has been made recently to provide Nek5000 with adaptive mesh refinement (AMR) ...

متن کامل

The Linearized Crocco Equation

In this paper, we study the existence and uniqueness of a degenerate parabolic equation, with nonhomogeneous boundary conditions, coming from the linearization of the Crocco equation [12]. The Crocco equation is a nonlinear degenerate parabolic equation obtained from the Prandtl equations with the so-called Crocco transformation. The linearized Crocco equation plays a major role in stabilizatio...

متن کامل

Solving Poisson’s Equation using Adaptive Mesh Refinement

This report discusses an implementation [1] of an Adaptive Mesh Refinement (AMR) Poisson solver which solves Poisson’s equation using multigrid relaxation. Local refinement introduces several added issues. Special care has been taken to match the solution across coarse/fine interfaces so that the solution maintains global second order accuracy. The nested mesh hierarchy can be defined by the us...

متن کامل

An Adaptive SAT Solver

This proposal outlines the creation of an adaptive algorithm for the Propositional Satisfiability Problem (SAT). The SAT problem is of great importance in theoretical computer science and verification. The proposed algorithm, or solver, uses the well-known DPLL approach coupled with a variety of optimizations and extensions which are selectively turned on and off during runtime to adapt to the ...

متن کامل

An Adaptive, Finite Difference Solver for the Nonlinear Poisson-Boltzmann Equation with Applications to Biomolecular Computations

We present a solver for the Poisson-Boltzmann equation and demonstrate its applicability for biomolecular electrostatics computation. The solver uses a level set framework to represent sharp, complex interfaces in a simple and robust manner. It also uses non-graded, adaptive octree grids which, in comparison to uniform grids, drastically decrease memory usage and runtime without sacrificing acc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Computational Chemistry

سال: 2021

ISSN: ['0192-8651', '1096-987X']

DOI: https://doi.org/10.1002/jcc.26716